A Pvs Speciication of Omh-ftp
نویسندگان
چکیده
omhftpT : type; error : T; num : above2]; R; UnR : T ! T ]] : theory begin assuming R ax : assumption (8 (t : T) : R(t) 6 = error) UnR ax : assumption (8 (t : T) : UnR(R(t)) = t) endassuming t : var T
منابع مشابه
Using PVS for an Assertional Verification of the RPC-Memory Specification Problem
The RPC-Memory Speciication Problem has been speciied and veriied in an assertional method, supported by the veriication system PVS. Properties of the components are expressed in the higher-order logic of PVS and all implementations have been veriied by means of the interactive proof checker of PVS. A simpliication of the memory speciication-allowing multiple atomic reads-has been proved correc...
متن کاملTowards a Duration Calculus Proof Assistant in PVS
The Duration Calculus (DC) is an interval temporal logic for reasoning about real-time systems. This paper describes a tool for constructing DC speciications and checking DC proofs. The proof assistant is implemented by encoding the semantics of DC within the higher-order logic of a general-purpose speciication and veriication environment called PVS. We develop a Gentzen style sequent proof sys...
متن کاملHierarchical Veri cation of Two - DimensionalHigh - Speed Multiplication in PVS : A Case Study
It is shown how to use the PVS speciication language and proof checker to present a hierarchical formalization of a two-dimensional, high-speed integer multiplier on the gate level. We rst give an informal description of iterative array multiplier circuits together with a natural reenement into vertical and horizontal stages, and then show how the various features of PVS can be used to obtain a...
متن کاملModular Veriication of Srt Division *
We describe a formal speciication and mechanized veriication in PVS of the general theory of SRT division along with a speciic hardware realization of the algorithm. The speciica-tion demonstrates how attributes of the PVS language (in particular, predicate subtypes) allow the general theory to be developed in a readable manner that is similar to textbook presentations, while the PVS table cons...
متن کاملModular Verification of SRT Division
We describe a formal speciication and veriication in PVS for the general theory of SRT division, and for the hardware design of a spe-ciic implementation. The speciication demonstrates how attributes of the PVS language (in particular, predicate subtypes) allow the general theory to be developed in a readable manner that is similar to textbook presentations, while the PVS table construct allows...
متن کامل